Scalable algorithm simplification using quantum AND logic

Abstract Implementing quantum algorithms on realistic devices requires translating high-level global operations into sequences of hardware-native logic gates, a process known as compiling. Physical limitations, such constraints in connectivity and gate alphabets, often result unacceptable implementation costs. To enable successful near-term applications, it is crucial to optimize compilation by exploiting the capabilities existing hardware. Here we implement resource-efficient construction for version AND that can reduce overhead, enabling execution key circuits. On high-scalability superconducting processor, demonstrate low-depth synthesis high-fidelity generalized Toffoli gates with up 8 qubits Grover’s search algorithm space 64 entries. Our experimental demonstration illustrates scalable widely applicable approach implementing algorithms, bringing more meaningful applications noisy within reach.